Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
نویسندگان
چکیده
In this paper we describe a new identity-based signcryption (IBSC) scheme built upon bilinear maps. This scheme turns out to be more efficient than all others proposed so far. We prove its security in a formal model under recently studied computational assumptions and in the random oracle model. As a result of independent interest, we propose a new provably secure identity-based signature (IBS) scheme that is also faster than all known pairing-based IBS methods.
منابع مشابه
Efficient and Identity-based Signcryption with Provably-secure
The idea of signcryption is to provide a method to encrypt and sign data together, so it is more efficient than using an encryption scheme combined with a signature scheme. We present an identitybased signcryption solution, which is one of the most efficient, provably-secure schemes proposed to date. Our scheme admits provable security in the random oracle model under the bilinear DiffieHellman...
متن کاملProvably Secure Identity-based Aggregate Signcryption Scheme in Random Oracles
This article proposes a provably secure aggregate signcryption scheme in random oracles. Security of the scheme is based on computational infeasibility of solving Decisional Bilinear Diffie-Hellman Problem and Discrete Logarithm Problems. Confidentiality and authenticity are two fundamental security requirements of Public key Cryptography. These are achieved by encryption scheme and digital sig...
متن کاملExtensions of Public-Key, Identity-Based and Certificateless Encryption Schemes
In this work, we first study extensions and applications of the identity-based encryption (IBE) primitive, focusing on generic constructions. We first define what is meant by an identity-based key encapsulation mechanism before extending it to the multi-recipient setting. We then propose an efficient multi-recipient scheme based on bilinear maps and then move on to investigate the properties of...
متن کاملCryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practical identity based signcryption schemes without bilinear pairing are considered to be almost impossible, it will be interesting to explore possibilities of constructing such systems in other settings like certificateless cryptog...
متن کاملNew identity based signcryption schemes from pairings
We present a new identity based scheme based on pairings over elliptic curves. It combines the functionalities of signature and encryption and is provably secure in the random oracle model. We compare it with Malone-Lee’s one from security and efficiency points of view. We give a formal proof of semantical security under the Decisional Bilinear Diffie-Hellman assumption for this new scheme and ...
متن کامل